An Autonomous Manufacturing Collective for Job Shop Scheduling

نویسندگان

  • Steven Y. Goldsmith
  • Leslie D. Interrante
چکیده

This paper describes an ongoing research project in distributed, agent-based manufacturing scheduling systems which exhibit collective system behavior. A scheduling system is described which exhibits purely low-level, reactive behavior. Two types of agents comprise the collective: part agents and machine agents. The collective is a mixedinitiative system in which agents representing parts attempt to maximize part flow to the next machine and agents representing machines attempt to maximize their utilization. Agents of the collective contain only local knowledge: a machine agent schedules operations on its machine and a part agent commits available parts to machine operations. This architecture provides an opportunity to use reinforcement learning techniques to allow an agent of the collective to improve performance by learning patterns of local interactions over time. Furthermore, both agent types of the collective exhibit anytime behavior by continuously computing the next decision until it is required to commit a decision to a fellow agent. Such agent information will bc of value in further research, the goal of which is to allow the dynamic collective adapts its architecture at runtime in response to unresolvable scheduling conflicts by creating temporary, higher-level agents opportunistically to handle particular situations. The architecture of the Autonomous Manufacturing Collective (AMC) is described herein. Copyright © 1998, American Association for Artificial Intelligence (www.aaai.org). All rights reserved

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intelligent Job Shop Scheduling Based on MAS and Integrated Routing Wasp Algorithm and Scheduling Wasp Algorithm

Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. An organization structure for intelligent job shop scheduling based on MAS (Multiple Agents System) is put forward to achieve effective and efficient production. A hybrid multilayer agent st...

متن کامل

Economically Coordinated Job Shop Scheduling and Decision Point Bidding - An Example for Economic Coordination in Manufacturing and Logistics

We discuss the application of economic coordination mechanisms to scheduling problems in manufacturing and logistics. We use job shop scheduling as a sample problem domain. We study economically augmented job shop problems (EJSP) which comprise valuation information. We demonstrate how instances of EJSP can be mapped to combinatorial job shop auction problems (CJSAP). A discussion of the tracta...

متن کامل

Genetic Algorithms for Solving Scheduling Problems in Flexible Manufacturing Cells

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

متن کامل

Production Scheduling in Complex Job Shops from an Industry 4.0 Perspective: A Review and Challenges in the Semiconductor Industry

On the one hand, Industrie 4.0 has recently emerged as the keyword for increasing productivity in the 21st century. On the other hand, production scheduling in a Complex Job Shop (CJS) environment, such as wafer fabrication facilities, has drawn interest of researchers dating back to the 1950s [65, 18]. Although both research areas overlap, there seems to be very little interchange of ideas. Th...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001